Predicted Virtual Soft Shadow Maps with High Quality Filtering

نویسندگان

  • Li Shen
  • Gaël Guennebaud
  • Baoguang Yang
  • Jieqing Feng
چکیده

In this paper we present a novel image based algorithm to render visually plausible anti-aliased soft shadows in a robust and efficient manner. To achieve both high visual quality and high performance, it employs an accurate shadow map filtering method which guarantees smooth penumbrae and high quality anisotropic anti-aliasing of the sharp transitions. Unlike approaches based on pre-filtering approximations, our approach does not suffer from light bleeding or losing contact shadows. Discretization artefacts are avoided by creating virtual shadow maps on the fly according to a novel shadow map resolution prediction model. This model takes into account the screen space frequency of the penumbrae via a perceptual metric which has been directly established from an appropriate user study. Consequently, our algorithm always generates shadow maps with minimal resolutions enabling high performance while guarantying high quality. Thanks to this perceptual model, our algorithm can sometimes be faster at rendering soft shadows than hard shadows. It can render game-like scenes at very high frame rates, and extremely large and complex scenes such as CAD models at interactive rates. In addition, our algorithm is highly scalable, and the quality versus performance trade-off can be easily tweaked.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Soft Shadows by Ray Tracing Multilayer Transparent Shadow Maps

We present a method for high quality soft shadows for area lights in cinematic lighting. The method is an extension of traditional shadow maps, so it has the advantage of image based shadow methods; the algorithm’s complexity is independent of geometric complexity. We introduce multilayer transparent shadow maps, which can be used to produce high quality soft shadows for scenes with extremely c...

متن کامل

Exponential shadow maps

Rendering high-quality shadows in real-time is a challenging problem. Shadow mapping has proved to be an efficient solution, as it scales well for complex scenes. However, it suffers from aliasing problems. Filtering the shadow map alleviates aliasing, but unfortunately, native hardware-accelerated filtering cannot be applied, as the shadow test has to take place beforehand. We introduce a simp...

متن کامل

Soft bilateral filtering volumetric shadows using cube shadow maps

Volumetric shadows often increase the realism of rendered scenes in computer graphics. Typical volumetric shadows techniques do not provide a smooth transition effect in real-time with conservation on crispness of boundaries. This research presents a new technique for generating high quality volumetric shadows by sampling and interpolation. Contrary to conventional ray marching method, which re...

متن کامل

Exponential Soft Shadow Mapping

In this paper we present an image-based algorithm to render visually plausible anti-aliased soft shadows in real time. Our technique employs a new shadow pre-filtering method based on an extended exponential shadow mapping theory. The algorithm achieves faithful contact shadows by adopting an optimal approximation to exponential shadow reconstruction function. Benefiting from a novel overflow f...

متن کامل

Layered variance shadow maps

Real-Time (60fps @ 1920x1200) Shadows Produced Using Our Algorithm Variance shadow maps (VSMs) provide an e cient way to produce highquality, ltered shadows in real-time, but su er from light bleeding artifacts. Layered variance shadow maps automatically partition the depth range into multiple layers, which alleviates or eliminates light bleeding artifacts. Compared to VSMs, LVSMs: • Reduce or ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2011